Discrete least squares approximation of piecewise-linear functions by trigonometric polynomials
نویسندگان
چکیده
منابع مشابه
Discrete Least Squares Approximation by Trigonometric Polynomials
We present an efficient and reliable algorithm for discrete least squares approximation of a real-valued function given at arbitrary distinct nodes in [0, 2tt) by trigonometric polynomials. The algorithm is based on a scheme for the solution of an inverse eigenproblem for unitary Hessenberg matrices, and requires only O(mn) arithmetic operations as compared with 0(mn ) operations needed for alg...
متن کاملUniform approximation by discrete least squares polynomials
We study uniform approximation of differentiable or analytic functions of one or several variables on a compact set K by a sequence of discrete least squares polynomials. In particular, if K satisfies a Markov inequality and we use point evaluations on standard discretization grids with the number of points growing polynomially in the degree, these polynomials provide nearly optimal approximant...
متن کاملLeast Squares Approximation by One-Pass Methods with Piecewise Polynomials
We propose several one-pass methods for data fitting in which a piecewise polynomial is used as an approximating function. The polynomial pieces are calculated step-by-step by the method of least squares as the data is -----------,scaIIIIed umy-once-from the begimring La tIre end. To calculate the least squares fitting in each step, we use three classes of data, namely: the data in the current ...
متن کاملOn Numerical Methods for Discrete Least-squares Approximation by Trigonometric Polynomials
Fast, efficient and reliable algorithms for discrete least-squares approximation of a real-valued function given at arbitrary distinct nodes in [0, 2π) by trigonometric polynomials are presented. The algorithms are based on schemes for the solution of inverse unitary eigenproblems and require only O(mn) arithmetic operations as compared to O(mn2) operations needed for algorithms that ignore the...
متن کاملA Note on Newbery’s Algorithm for Discrete Least-squares Approximation by Trigonometric Polynomials
Recently fast, efficient and reliable algorithms for discrete least-squares approximation of a real-valued function given at arbitrary distinct nodes in [0, 2π) by trigonometric polynomials were presented in different papers. These algorithms are based on schemes for the solution of inverse unitary eigenproblems and require only O(mn) arithmetic operations as compared to O(mn) operations needed...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Issues of Analysis
سال: 2017
ISSN: 2306-3432
DOI: 10.15393/j3.art.2017.4070